Particle Swarm Optimization with Simulated Annealing for TSP

نویسندگان

  • LUPING FANG
  • PAN CHEN
  • SHIHUA LIU
چکیده

-Aiming at the shortcoming of basic PSO algorithm, that is, easily trapping into local minimum, we propose an advanced PSO algorithm with SA and apply this new algorithm for solving TSP problem. The core of algorithm is based on the PSO algorithm. SA method is used to slow down the degeneration of the PSO swarm and increase the swarm’s diversity. The comparative experiments were made between PSO-SA, basic GA, basic SA and basic ACA on solving TSP problem. Results show PSO-SA is more superior to other methods. Key-Words: particle swarm optimization; simulating annealing algorithm; TSP; GA

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Particle Swarm Optimization with Simulated Annealing and Neighborhood Information Communication for Solving TSP

In this paper, an effective hybrid algorithm based on Particle Swarm Optimization (PSO) is proposed for solving the Traveling Salesman Problem (TSP), which is a well-known NPcomplete problem. The hybrid algorithm combines the high global search efficiency of fuzzy PSO with the powerful ability to avoid being trapped in local minimum. In the fuzzy PSO system, fuzzy matrices were used to represen...

متن کامل

AN EFFICIENT HYBRID ALGORITHM BASED ON PARTICLE SWARM AND SIMULATED ANNEALING FOR OPTIMAL DESIGN OF SPACE TRUSSES

In this paper, an efficient optimization algorithm is proposed based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) to optimize truss structures. The proposed algorithm utilizes the PSO for finding high fitness regions in the search space and the SA is used to perform further investigation in these regions. This strategy helps to use of information obtained by swarm in an opt...

متن کامل

A Multi-Objective Particle Swarm Optimization for Mixed-Model Assembly Line Balancing with Different Skilled Workers

This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...

متن کامل

A Hybrid Particle Swarm Optimization – Simulated Annealing Algorithm for the Probabilistic Travelling Salesman Problem

The Probabilistic Traveling Salesman Problem (PTSP) is a variation of the well known Traveling Salesman Problem (TSP). This problem arises when the information about customers demand is not available at the moment of the tour generation and/or the tour re-calculating cost is too elevated. In this article, a Hybrid Algorithm combining Particle Swarm Optimization (PSO) and Simulated Annealing (SA...

متن کامل

An Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems

Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007